/* SPDX-License-Identifier: BSD-2-Clause */

/**
 *  @file
 *
 *  @brief POSIX Is Priority Valid
 *  @ingroup POSIX_PRIORITY
 */

/*
 *  COPYRIGHT (c) 1989-2008.
 *  On-Line Applications Research Corporation (OAR).
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <rtems/posix/priorityimpl.h>
#include <rtems/score/schedulerimpl.h>

Priority_Control _POSIX_Priority_To_core(
  const Scheduler_Control *scheduler,
  int                      posix_priority,
  bool                    *valid
)
{
  Priority_Control core_posix_priority;
  Priority_Control core_priority;

  core_posix_priority = (Priority_Control) posix_priority;
  core_priority = scheduler->maximum_priority - core_posix_priority;

  *valid = ( posix_priority >= POSIX_SCHEDULER_MINIMUM_PRIORITY
    && core_posix_priority < scheduler->maximum_priority );

  return _Scheduler_Map_priority( scheduler, core_priority );
}

int _POSIX_Priority_From_core(
  const Scheduler_Control *scheduler,
  Priority_Control         core_priority
)
{
  core_priority = _Scheduler_Unmap_priority( scheduler, core_priority );

  return (int) ( scheduler->maximum_priority - core_priority );
}
